Degree sum and connectivity conditions for dominating cycles
نویسندگان
چکیده
منابع مشابه
Degree sum conditions and vertex-disjoint cycles in a graph
We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.
متن کاملOn vertex-disjoint cycles and degree sum conditions
This paper considers a degree sum condition sufficient to imply the existence of k vertexdisjoint cycles in a graph G. For an integer t ≥ 1, let σt (G) be the smallest sum of degrees of t independent vertices of G. We prove that if G has order at least 7k+1 and σ4(G) ≥ 8k−3, with k ≥ 2, then G contains k vertex-disjoint cycles. We also show that the degree sum condition on σ4(G) is sharp and co...
متن کاملDegree Sum and Vertex Dominating Paths
A vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P . In 1988 H. Broersma stated a result implying that every n-vertex kconnected graph G such that σ(k+2)(G) ≥ n− 2k − 1 contains a dominating path. We show that every n-vertex k-connected graph with σ2(G) ≥ 2n k+2 + f(k) contains a dominating path of length at most O(|T |), where T is a minimum do...
متن کاملTwo sufficient conditions for dominating cycles
A cycle C of a graph G is dominating if each component of GnC is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3-connected graph to be a dominating cycle. 2005 Wiley Periodicals, Inc. J Graph Theory 49: 135–150, 2005
متن کاملMinimum degree conditions for cycles
In this note we discuss the lengths of cycles which are forced to exist in an n-vertex graph with minimum degree δ. We show that for any integer k ≥ 2 there exists n0 such that if n ≥ n0 and G is an n-vertex graph with δ(G) = δ ≥ n/k then the following are true. (i) G contains Ct for every even 4 ≤ t ≤ ⌈ n k−1 ⌉ , (ii) either G is in a known exceptional class or G contains Ct for every odd t ∈ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.019